Singleton Bounds for Codes over Finite Rings

نویسنده

  • KEISUKE SHIROMOTO
چکیده

We introduce the Singleton bounds for codes over a finite commutative quasi-Frobenius ring.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on the Singleton bounds for codes over finite rings

In this paper, we give a notation on the Singleton bounds for linear codes over a finite commutative quasi-Frobenius ring in the work of Shiromoto [5]. We show that there exists a class of finite commutative quasi-Frobenius rings. The Singleton bounds for linear codes over such rings satisfy d(C) − 1 A ≤ n− log|R| |C|. keywords : Linear codes, General weight, Quasi-Frobenius ring, Singleton bounds

متن کامل

New bounds for codes over finite Frobenius rings

We give further results on the question of code optimality for linear codes over finite Frobenius rings for the homogeneous weight. This article improves on the existing Plotkin bound derived in an earlier paper [6], and suggests a version of a Singleton bound. We also present some families of codes meeting these new bounds.

متن کامل

Gilbert-Varshamov type bounds for linear codes over finite chain rings

We obtain finite and asymptotic Gilbert-Varshamov type bounds for linear codes over finite chain rings with various weights.

متن کامل

Gray Images of Constacyclic Codes over some Polynomial Residue Rings

Let  be the quotient ring    where  is the finite field of size   and  is a positive integer. A Gray map  of length  over  is a special map from  to ( . The Gray map   is said to be a ( )-Gray map if the image of any -constacyclic code over    is a -constacyclic code over the field   . In this paper we investigate the existence of   ( )-Gray maps over . In this direction, we find an equivalent ...

متن کامل

Quasi-Cyclic Codes Over Finite Chain Rings

In this paper, we mainly consider quasi-cyclic (QC) codes over finite chain rings. We study module structures and trace representations of QC codes, which lead to some lower bounds on the minimum Hamming distance of QC codes. Moreover, we investigate the structural properties of 1-generator QC codes. Under some conditions, we discuss the enumeration of 1-generator QC codes and describe how to o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000